Deciding DPDA Equivalence Is Primitive Recursive
نویسنده
چکیده
Recently Sénizergues showed decidability of the equivalence problem for deterministic pushown automata. The proof of decidability is two semi-decision procedures that do not give a complexity upper bound for the problem. Here we show that there is a simpler deterministic decision procedure that has a primitive recursive upper bound.
منابع مشابه
A Short Decidability Proof for DPDA Language Equivalence via First-Order Grammars
The main aim of the paper is to give a short self-contained proof of the decidability of language equivalence for deterministic pushdown automata, which is the famousproblem solved by G. Sénizergues, for which C. Stirling has derived a primitive recursive complexity upper bound. The proof here is given in the framework of first-order grammars, which seems to be particularly apt for the aim.
متن کاملOn the Equivalence Problem for Attribute Systems
The authors have shown in Courcelle et al. (1982) that certain attribute systems called strongly noneireular can be translated into recursive program schemes taking derivation trees as arguments and called primitive reeursive schemes with parameters. In particular, the equivalence problem for strongly noncircular attribute systems reduces to the equivalence problem for the latter class of progr...
متن کاملIdealized Algol with Ground Recursion, and DPDA Equivalence
We prove that observational equivalence of IA3 + Y0 (3rdorder Idealized Algol with 0th-order recursion) is equivalent to the DPDA Equivalence Problem, and hence decidable. This completes the classification of decidable fragments of Idealized Algol. We also prove that observational approximation of IA1 + Y0 is undecidable by reducing the DPDA Containment Problem to it.
متن کاملObservational Equivalence of 3rd-Order Idealized Algol is Decidable
We prove that observational equivalence of 3rd-order finitary Idealized Algol (IA) is decidable using Game Semantics. By modelling state explicitly in our games, we show that the denotation of a term M of this fragment of IA (built up from finite base types) is a compactly innocent strategy-with-state i.e. the strategy is generated by a finite view function fM . Given any such fM , we construct...
متن کاملSchema Revisited
Two schema problems from the 1970s are examined, monadic recursion schemes and first-order recursion schemas. Research on these problems halted because they were shown to be equivalent to the problem of decidability of language equivalence between DPDA (deterministic pushdown automata). Recently a decidability proof for equivalence of DPDA was given by Sénizergues [10, 11], which therefore also...
متن کامل